Increasing triplet subsequence

Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.

Input: nums = [1,2,3,4,5]

Output: true

Explanation: Any triplet where i < j < k is valid.

/**
 * @param {number[]} nums
 * @return {boolean}
 */
var increasingTriplet = function(nums) {
   let first = Infinity;
   let second = Infinity;

   for (let num of nums) {
       if (num <= first) {
           first = num;
       } else if (num <= second) {
           second = num;
       } else {
           return true;
       }
   }
   return false;
};